Sharp generalized Trudinger inequalities via truncation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Form for Improved Moser-trudinger Inequality

S2 (|∇u| + 2u)}, and the equality holds if and only if eg is a metric of constant curvature. In the study of deforming metrics and prescribing curvatures on S, this inequality is often used to control the size and behavior of a new metric eg0 near a concentration point. With certain “balance” condition on the metric one would guess that if the metric concentrates, it should concentrate at more ...

متن کامل

Sharp Isoperimetric Inequalities via the Abp Method

We prove some old and new isoperimetric inequalities with the best constant using the ABP method applied to an appropriate linear Neumann problem. More precisely, we obtain a new family of sharp isoperimetric inequalities with weights (also called densities) in open convex cones of R. Our result applies to all nonnegative homogeneous weights satisfying a concavity condition in the cone. Remarka...

متن کامل

Affine Moser-Trudinger and Morrey-Sobolev inequalities

Abstract: An affine Moser-Trudinger inequality, which is stronger than the Euclidean MoserTrudinger inequality, is established. In this new affine analytic inequality an affine energy of the gradient replaces the standard L energy of gradient. The geometric inequality at the core of the affine Moser-Trudinger inequality is a recently established affine isoperimetric inequality for convex bodies...

متن کامل

Sobolev Inequalities: Symmetrization and Self Improvement via Truncation

We develop a new method to obtain symmetrization inequalities of Sobolev type. Our approach leads to new inequalities and considerable simplification in the theory of embeddings of Sobolev spaces based on rearrangement invariant spaces.

متن کامل

Generalized Gauss inequalities via semidefinite programming

A sharp upper bound on the probability of a random vector falling outside a polytope, based solely on the first and second moments of its distribution, can be computed efficiently using semidefinite programming. However, this Chebyshev-type bound tends to be overly conservative since it is determined by a discrete worst-case distribution. In this paper we obtain a less pessimistic Gauss-type bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2006

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2005.07.041